Weak subintuitionistic logics

نویسندگان

  • Fatemeh Shirmohammadzadeh Maleki
  • Dick de Jongh
چکیده

A system WF of subintuitionistic logic is introduced, weaker than Corsi’s basic subintuitionistic system F. A derivation system with and without hypotheses is given in line with the authors’ derivation system for F. A neighborhood semantics is introduced with a somewhat more complex definition than the neighborhood semantics for non-normal modal logics. Completeness is proved for WF with respect to this neighborhood semantics, and similarly for some logics between WF and F which characterize nice frame classes. The study by the authors of the conservativity of IPC over F with respect to some classes of implications is extended to WF, and shows clearly the difference in strength between the two logics. Study of translations of these weak subintuitionistic logics into non-normal modal logics turned out to be hard because of the difference between their respective neighborhood structures and leaves us with some open problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subintuitionistic Logics with Kripke Semantics

The subintuitionistic logics introduced by Corsi and Restall are developed in a uniform manner. Proof systems are given for derivations without and with assumptions. The results are applied to give conservation theorems for intuitionistic logic IPC over Corsi’s system F. For Visser’s basic logic strong completeness is proved and additional conservation results are obtained.

متن کامل

A Closer Look at Some Subintuitionistic Logics

In the present paper we study systematically several consequence relations on the usual language of propositional intuitionistic logic that can be defined semantically by using Kripke frames and the same defining truth conditions for the connectives as in intuitionistic logic but without imposing some of the conditions on the Kripke frames that are required in the intuitionistic case. The logic...

متن کامل

Tree-Sequent Methods for Subintuitionistic Predicate Logics

Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate logics of this kind by the method of tree-sequent calculus (a special form of Labelled Deductive System). After proving the completeness with respect to some classes of Kripke models, we introduce Hilbert-style axiom sys...

متن کامل

Classical and Empirical Negation in Subintuitionistic Logic

Subintuitionistic (propositional) logics are those in a standard intuitionistic language that result by weakening the frame conditions of the Kripke semantics for intuitionistic logic. In this paper we consider two negation expansions of subintuitionistic logic, one by classical negation and the other by what has been dubbed “empirical” negation. We provide an axiomatization of each expansion a...

متن کامل

Subintuitionistic Logics

Weakening the conditions on the Kripke semantics for propositional intuitionistic logic (J) unearths a family of logics below J. This paper provides a characterization of eleven such logics, using Kripke semantics, proof theory, and algebraic models. Questions about modelling quantification in these logics are also discussed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2017